An asymptotics for the number of labelled planar tetracyclic and pentacyclic graphs
نویسندگان
چکیده
A connected graph with a cyclomatic number k is said to be k-cyclic graph. We obtain the formula for of labelled non-planar pentacyclic graphs given vertices, and find asymptotics planar tetracyclic n vertices as → ∞. prove that under uniform probability distribution on set consideration, asymptotically equal 1089/1105, labeled 1591/1675.
منابع مشابه
nano-rods zno as an efficient catalyst for the synthesis of chromene phosphonates, direct amidation and formylation of amines
چکیده ندارد.
Random planar graphs and the number of planar graphs
We survey recent progress on the enumeration of labelled planar graph and on the distribution of several parameters in random planar graphs. The main goal is to show how to use generating functions to obtain asymptotic estimates and limit probability laws. The emphasis is on presenting the main ideas while keeping technical details to a minimum.
متن کاملThe Number of Labelled k-Arch Graphs
In this note, we deal with k-arch graphs, a generalization of trees, which contain k-trees as a subclass. We show that the number of vertex-labelled k-arch graphs with n vertices, for a fixed integer k ≥ 1, is (nk)n−k−1. As far as we know, this is a new integer sequence. We establish this result with a one-to-one correspondence relating k-arch graphs and words whose letters are k-subsets of the...
متن کاملdevelopment and implementation of an optimized control strategy for induction machine in an electric vehicle
in the area of automotive engineering there is a tendency to more electrification of power train. in this work control of an induction machine for the application of electric vehicle is investigated. through the changing operating point of the machine, adapting the rotor magnetization current seems to be useful to increase the machines efficiency. in the literature there are many approaches wh...
15 صفحه اولMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Prikladnaâ diskretnaâ matematika
سال: 2023
ISSN: ['2311-2263', '2071-0410']
DOI: https://doi.org/10.17223/20710410/59/4